Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
نویسنده
چکیده
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresultants algorithm. Up to our knowledge it is the first mechanized proof of this result.
منابع مشابه
The ERES Method for Computing the Approximate GCD
The computation of the greatest common divisor (GCD) of a set of polynomials has interested the mathematicians for a long time and has attracted a lot of attention in recent years. A challenging problem that arises from several applications, such as control or image and signal processing, is to develop a numerical GCD method that inherently has the potential to work efficiently with sets of sev...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملSparse Polynomial Interpolation and the Fast Euclidean Algorithm
We introduce an algorithm to interpolate sparse multivariate polynomials with integer coefficients. Our algorithm modifies Ben-Or and Tiwari’s deterministic algorithm for interpolating over rings of characteristic zero to work modulo p, a smooth prime of our choice. We present benchmarks comparing our algorithm to Zippel’s probabilistic sparse interpolation algorithm, demonstrating that our alg...
متن کاملAlgebraic Factorization and GCD Computation
This chapter describes several algorithms for factorization and GCD computation of polynomials over algebraic extension fields. These algorithms are common in using the characteristic set method introduced in the previous chapters. Some performance comparisons between these algorithms are reported. Applications include geometry theorem proving, irreducible decomposition of algebraic variaities,...
متن کاملThe approximate GCD of inexact polynomials Part II: a multivariate algorithm
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. The method and the companion software appears to be the first practical package with such capabilities. The most significant features of the algorithm are its robustness and accuracy as demonstrated in the results of c...
متن کامل